Progressive Temporal Window Widening

نویسنده

  • David Tolpin
چکیده

This paper introduces a scheme for data stream processing which is robust to batch duration. Streaming frameworks process streams in batches retrieved at fixed time intervals. In a common setting a pattern recognition algorithm is applied independently to each batch. Choosing the right time interval is tough — a pattern may not fit in an interval which is too short, but detection will be delayed and memory may be exhausted if the interval is too long. We propose here Progressive Window Widening, an algorithm for increasing the interval gradually so that patterns are caught at any pace without unnecessary delays or memory overflow. This algorithm is relevant to computer security, system monitoring, user behavior tracking, and other applications where patterns of unknown or varying duration must be recognized online in data streams. Modern data stream processing frameworks are ubiquitously used to process high volumes of data, and adaptive memory and CPU allocation, facilitated by Progressive Window Widening, is crucial for their performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prediction of Noise Transmission Loss and Acoustic Comfort Assessment of a Ventilated Window using Statistical Energy Analysis

In this paper, a novel analytical method was developed based on statistical energy analysis framework to evaluate sound transmission loss through ventilated windows. The proposed method was compared to numerical and analytical models available in the literature. Results showed the success and advantage of the proposed model in predicting the acoustic performance of the ventilated window and the...

متن کامل

Adding Double Progressive Widening to Upper Confidence Trees to Cope with Uncertainty in Planning Problems

Current state of the art methods in energy policy planning only approximate the problem (Linear Programming on a finite sample of scenarios, Dynamic Programming on an approximation of the problem, etc). Monte-Carlo Tree Search (MCTS [3]) seems to be a potential candidate to converge to an exact solution of these problems ([2]). But how fast, and how do key parameters (double/simple progressive ...

متن کامل

Continuous Upper Confidence Trees

Upper Confidence Trees are a very efficient tool for solving Markov Decision Processes; originating in difficult games like the game of Go, it is in particular surprisingly efficient in high dimensional problems. It is known that it can be adapted to continuous domains in some cases (in particular continuous action spaces). We here present an extension of Upper Confidence Trees to continuous st...

متن کامل

Probing expert anticipation with the temporal occlusion paradigm: experimental investigations of some methodological issues.

Two experiments were conducted to examine whether the conclusions drawn regarding the timing of anticipatory information pick-up from temporal occlusion studies are influenced by whether (a) the viewing period is of variable or fixed duration and (b) the task is a laboratory-based one with simple responses or a natural one requiring a coupled, interceptive movement response. Skilled and novice ...

متن کامل

Q-Learning with Double Progressive Widening: Application to Robotics

Discretization of state and action spaces is a critical issue in Q-Learning. In our contribution, we propose a real-time adaptation of the discretization by the progressive widening technique which has been already used in bandit-based methods. Results are consistently converging to the optimum of the problem, without changing the parametrization for each new problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1604.00997  شماره 

صفحات  -

تاریخ انتشار 2016